Linear trees in uniform hypergraphs
نویسندگان
چکیده
منابع مشابه
Forestation in Hypergraphs: Linear k-Trees
We present a new proof of a result of Lovász on the maximum number of edges in a k-forest. We also apply a construction used in our proof to generalize the notions of a k-hypertree and k-forest to a class which extends some properties of trees, to which both specialize when k=2.
متن کاملOn 3-uniform hypergraphs without linear cycles∗
We explore properties of 3-uniform hypergraphs H without linear cycles. It is surprising that even the simplest facts about ensuring cycles in graphs can be fairly complicated to prove for hypergraphs. Our main results are that 3-uniform hypergraphs without linear cycles must contain a vertex of strong degree at most two and must have independent sets of size at least 2|V (H)| 5 .
متن کاملChromatic Coefficients of Linear Uniform Hypergraphs
A simple hypergraph H=(X, E), with order |X| and size m=|E|, consists of a vertex-set V(H)=X and an edge-set E(H)=E, where E X and |E| 2 for each edge E in E. H is linear if no two edges intersect in more than one vertex, and H is h-uniform, or is an h-hypergraph, if |E|=h for each E in E. The number of edges containing a vertex x is its degree dH(x). Two vertices u, v of H are in the same comp...
متن کاملAsymptotic Enumeration of Sparse Uniform Linear Hypergraphs with Given Degrees
A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For n ≥ 3, let r = r(n) ≥ 3 be an integer and let k = (k1, . . . , kn) be a vector of nonnegative integers, where each kj = kj(n) may depend on n. Let M = M(n) = ∑n j=1 kj for all n ≥ 3, and define the set I = {n ≥ 3 | r(n) divides ...
متن کاملEdge intersection graphs of linear 3-uniform hypergraphs
Let L3 be the class of edge intersection graphs of linear 3-uniform hypergraphs. The problem of recognizing G ∈ L3 is NP-complete. Denote by δALG the minimal integer such that the problem ”G ∈ L3 ” is polynomially solvable in the class of graphs G with the minimal vertex degree δ(G) ≥ δALG and by δFIS the minimal integer such that L3 can be characterized by a finite list of forbidden induced su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2014
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.06.022